Fixed-Parameter Tractable Distances to Sparse Graph Classes
نویسندگان
چکیده
منابع مشابه
Parameterized complexity of distances to sparse graph classes
This dissertation offers contributions to the area of parameterized complexity theory, which studies the complexity of computational problems in a multivariate framework. We demonstrate that for graph problems, many popular parameters can be understood as distances that measure how far a graph is from belonging to a class of sparse graphs. We introduce the term distance parameter for such param...
متن کاملSome fixed-parameter tractable classes of Dual and related problems⋆
In this paper we present fixed-parameter algorithms for the problem Dual—given two hypergraphs, decide if one is the transversal hypergraph of the other—and related problems. In the first part, we give algorithms for the parameters number of edges of the hypergraphs, the maximum degree of a vertex, and vertex complementary degrees. In the second part, we use an Apriori approach to obtain FPT re...
متن کاملFixed-Parameter Tractable Reductions to SAT
Today’s SAT solvers have an enormous importance and impact in many practical settings. They are used as efficient back-end to solve many NP-complete problems. However, many computational problems are located at the second level of the Polynomial Hierarchy or even higher, and hence polynomial-time transformations to SAT are not possible, unless the hierarchy collapses. In certain cases one can b...
متن کاملImbalance Is Fixed Parameter Tractable
In the Imbalance Minimization problem we are given a graph G = (V,E) and an integer b and asked whether there is an ordering v1 . . . vn of V such that the sum of the imbalance of all the vertices is at most b. The imbalance of a vertex vi is the absolute value of the difference between the number of neighbors to the left and right of vi. The problem is also known as the Balanced Vertex Orderin...
متن کاملA Family of Tractable Graph Distances
Important data mining problems such as nearestneighbor search and clustering admit theoretical guarantees when restricted to objects embedded in a metric space. Graphs are ubiquitous, and clustering and classification over graphs arise in diverse areas, including, e.g., image processing and social networks. Unfortunately, popular distance scores used in these applications, that scale over large...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2016
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-016-0235-7